Adaptive $ D$-Hop Connected Dominating Set in Highly Dynamic Flying Ad-Hoc Networks

By exploring the intelligent cooperation of unmanned aerial vehicle (UAV) swarms, formed flying ad-hoc networks (FANETs) can support a variety collaborative operations with real-time communications in emergency scenarios. To reduce prohibitively high routing overhead connectivity guaranteed multi-hop links, UAV swarms construct virtual backbone network (VBN) based on graph-theoretical $d$ -hop connected dominating set ( -CDS), where each outside VBN send collected data to within distance. However, due dynamics FANETs scenarios, optimal solution may not match current status, which results frequently intermittent connectivity. Besides, recomputing from scratch will lead significant maintance costs. Therefore, it is crucial adapt minimal -CDS topology changes. this end, we propose an notation="LaTeX">$ \mathcal {O}(d\log (N))$ -approximation algorithm (i.e., N$ denotes maximal number nodes) expected {\widetilde{O}}(d\Delta ^2)$ \Delta$ degree vertex over sequence updates) time per update. The simulation demonstrate that our adaptive strike better trade-off among overhead, response time, and costs update compared state-of-the-art schemes